Singular value decomposition
SVD
Without loss of generality, suppose that . Any matrix can be written in the form:

where , , .
Denote the left singular vectors as columns in matrix (), singular values on the diagonal of matrix (), and right singular vectors as rows in matrix ().
The following are satisfied: , , and .
This is called the Singular Value Decomposition (SVD) of .
- The diagonals of are called singular values of (often sorted in decreasing order).
- The columns of are called the left singular vectors of .
- The columns of are called the right singular vectors of .
Characteristics
#incomplete
Geometric interpretation of SVD
Given any matrix , it defines a linear transformation
SVD of indicates linear transformation can be decomposed into a sequence of three operations
full transformation equals rotation rescaling rotation
βone of the most fundamental results in linear algebraβ
See also: spectral decomposition
References:
- https://www.chrismusco.com/amlds2023/notes/lecture11.html#Singular_Value_Decomposition
- Avrim Blum, John Hopcroft, and Ravindran Kannan, β3.4 Singular Value Decomposition (SVD)β in Foundations of Data Science, 2018, pp. 45-47. https://www.cs.cornell.edu/jeh/book.pdf
- https://www.cs.cmu.edu/~venkatg/teaching/CStheory-infoage/book-chapter-4.pdf
- G. Strang, β6.3 Singular Value Decompositionβ inΒ Introduction to Linear Algebra, 4th ed., Wellesley, MA: Wellesley-Cambridge Press, 2009, pp. 367-376.
- https://www.sjsu.edu/faculty/guangliang.chen/Math253S20/lec5svd.pdf
#incomplete